Dependence between External Path-Length and Size in Random Tries

نویسندگان

  • Michael Fuchs
  • Hsien-Kuei Hwang
چکیده

We study the size and the external path length of random tries and show that they are asymptotically independent in the asymmetric case but strongly dependent with small periodic fluctuations in the symmetric case. Such an unexpected behavior is in sharp contrast to the previously known results that the internal path length is totally positively correlated to the size and that both tend to the same normal limit law. These two examples provide concrete instances of bivariate normal distributions (as limit laws) whose correlation is 0, 1 and periodically oscillating.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE EXTERNAL PATH LENGTH OF RANDOM RECURSIVE k-ARY TREES

In this paper, we determine the expectation and variance of Xn the external path length in a random recursive k-ary tree of size n.

متن کامل

E = I + T: The internal extent formula for compacted tries

It is well known [Knu97, pages 399–400] that in a binary tree the external path length minus the internal path length is exactly 2n− 2, where n is the number of external nodes. We show that a generalization of the formula holds for compacted tries, replacing the role of paths with the notion of extent, and the value 2n−2 with the trie measure, an estimation of the number of bits that are necess...

متن کامل

The internal extent formula for compacted tries

It is well known [Knu97, pages 399–400] that in a binary tree the external path length minus the internal path length is exactly 2n 2, where n is the number of external nodes. We show that a generalization of the formula holds for compacted tries, replacing the role of paths with the notion of extent, and the value 2n 2with the trie measure, an estimation of the number of bits that are necessar...

متن کامل

On the variance of the external path length in a symmetric digital trie

Digital searching is a well-known technique for storing and retrieving information using lexicographical (digital) structure of words. A radix trie (in short: trie) is such a digital search tree that edges are labelled by elements from aa alphabet (e.g., binary alphabet consisting of O’s and l’s) and leaves (external nodes) contain keys [ 1,4,9]. More precisely, in a binary case a key is a (pos...

متن کامل

Profiles of Tries

Tries (from retrieval) are one of the most popular data structures on words. They are pertinent to the (internal) structure of stored words and several splitting procedures used in diverse contexts. The profile of a trie is a parameter that represents the number of nodes (either internal or external) with the same distance from the root. It is a function of the number of strings stored in a tri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1604.08658  شماره 

صفحات  -

تاریخ انتشار 2016